Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition
نویسندگان
چکیده
منابع مشابه
Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition
In this paper, we construct a class of vectorial Boolean functions over F2n with high algebraic immunity based on the decomposition of the multiplicative group of F2n . By viewing F2n as G1G2 ∪ {0} (where G1 and G2 are subgroups of F2n , (#G1,#G2) = 1 and #G1 × #G2 = 2 − 1), we give a generalized description for constructing vectorial Boolean functions with high algebraic immunity. Moreover, wh...
متن کاملConstructing $2m$-variable Boolean functions with optimal algebraic immunity based on polar decomposition of $\mathbb{F}_{2^{2m}}^*$
Constructing 2m-variable Boolean functions with optimal algebraic immunity based on decomposition of additive group of the finite field F22m seems to be a promising approach since Tu and Deng’s work. In this paper, we consider the same problem in a new way. Based on polar decomposition of the multiplicative group of F22m , we propose a new construction of Boolean functions with optimal algebrai...
متن کاملConstructing Boolean Functions With Potential Optimal Algebraic Immunity Based on Additive Decompositions of Finite Fields
We propose a general approach to construct cryptographic significant Boolean functions of (r + 1)m variables based on the additive decomposition F2rm × F2m of the finite field F 2(r+1)m , where r is odd and m ≥ 3. A class of unbalanced functions are constructed first via this approach, which coincides with a variant of the unbalanced class of generalized Tu-Deng functions in the case r = 1. Thi...
متن کاملBalanced Boolean Functions with Optimum Algebraic Immunity and High Nonlinearity
In this paper, three constructions of balanced Boolean functions with optimum algebraic immunity are proposed. The cryptographical properties such as algebraic degree and nonlinearity of the constructed functions are also analyzed.
متن کاملA Conjecture on Binary String and Its Applications on Constructing Boolean Functions of Optimal Algebraic Immunity
In this paper, we propose a combinatoric conjecture on binary string, on the premise that our conjecture is correct we mainly obtain two classes of functions which are both algebraic immunity optimal: the first class of functions are also bent, moreover, from this fact we conclude that the algebraic immunity of bent functions can take all possible values except one. The second class are balance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 2014
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207160.2014.910304